On solving the maximum clique problem
نویسندگان
چکیده
Abstract. The Maximum Clique Problem (MCP) is regarded here as the maximization of an indefinite quadratic form over the canonical simplex. For solving MCP an algorithm based upon Global Optimality Conditions (GOC) is applied. Furthermore, each step of the algorithm is analytically investigated and tested. The computational results for the proposed algorithm are compared with other Global Search approaches.
منابع مشابه
Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem
This contribution extends the Bron Kerbosch algorithm for solving the maximum weight clique problem, where continuous-valued weights are assigned to both, vertices and edges. We applied the proposed algorithm to graph matching problems.
متن کاملA Maximum Edge-weight Clique Finding Algorithmic Approach for Solving Protein Side-chain Positioning Problem
We have developed a novel approach to solve the protein side-chain packing problem using the notion of a maximum edge-weight clique. Our approach is based on efficient reduction of protein side-chain packing problem to a graph and then solving the reduced graph to find the maximum clique. Since our approach is based on deterministic algorithms in contrast to the various existing algorithms base...
متن کاملA New Exact Algorithm for the Maximum Weight Clique Problem
Given an undirected graph with weight for each vertex, the maximum weight clique problem is to find the clique of the maximum weight. Östergård proposed a fast exact algorithm for solving this problem. We show his algorithm is not efficient for very dense graphs. We propose an exact algorithm for the problem, which is faster than Östergård’s algorithm in case the graph is dense. We show the eff...
متن کاملUsing modular decomposition technique to solve the maximum clique problem
In this article we use the modular decomposition technique for exact solving the weighted maximum clique problem. Our algorithm takes the modular decomposition tree from the paper of Tedder et. al. and finds solution recursively. Also, we propose algorithms to construct graphs with modules. We show some interesting results, comparing our solution with Ostergards algorithm on DIMACS benchmarks a...
متن کاملSolving Hard Subgraph Problems in Parallel
We look at problems involving finding subgraphs in larger graphs, such as the maximum clique problem, the subgraph isomorphism problem, and the maximum common subgraph problem. We investigate variable and value ordering heuristics, different inference strategies, intelligent backtracking search (backjumping), and bitand thread-parallelism to exploit modern hardware.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Global Optimization
دوره 21 شماره
صفحات -
تاریخ انتشار 2001